Linear Constraint Programming for Cost-optimized Configuration of Modular Assembly Systems
نویسندگان
چکیده
منابع مشابه
An Agent-based Self-configuration Methodology for Modular Assembly Systems
Assembly systems today are exposed to market trends that have become increasingly more dynamic and unpredictable, requiring product changes and adjustments which emphasise de need for more flexible systems. The requirement for increased responsiveness has led to the development of new modular concepts which provide the bases for achieving higher system adaptability through increased component/m...
متن کاملConfiguration management via constraint programming
1 Abstract As the complexity of computer systems has increased, the task of managing those systems has grown to the point where the assistance of the computer itself is required. The diversity of management tasks has, in turn, lead to a diversity of software. In Unix, for example, make(1), rcs(1) and cron(8) each address this issue. Distributed systems expand the realm of connguration managemen...
متن کاملConstraint programming for stochastic inventory systems under shortage cost
One of the most important policies adopted in inventory control is the replenishment cycle policy. Such a policy provides an effective means of damping planning instability and coping with demand uncertainty. In this paper we develop a constraint programming approach able to compute optimal replenishment cycle policy parameters under non-stationary stochastic demand, ordering, holding and short...
متن کاملcost-oriented assembly line balancing with resource constraint
in this paper, based on the background of cost-oriented assembly line balancing problems, a novel mathematical model for scheduling and balancing the assembly line is offered that with the combination of task sequence-dependent setup time, parallel stations and resource constraint, minimizes the operational and investment costs of assembly system. due to the complexity of the problem, the equat...
متن کاملSymmetiy Constraint Inference in Assembly Planning: Automatic Assembly Configuration Specification
In this paper we shall discuss how to treat the automatic generation of assembly task specifications as a constraint satisfaction problem (CSP) over finite and infinite domains. Conceptually it is straightforward to formulate assembly planning in terms of CSP, however the choice of constraint representation and of the order in which the constraints are applied is nontrivial if a computationally...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia CIRP
سال: 2016
ISSN: 2212-8271
DOI: 10.1016/j.procir.2016.11.073